Skew Tableaux, Lattice Paths, and Bounded Partitions

We establish a one to one correspondence between a set of certain bounded partitions and a set of two-rowed standard Young tableaux of skew shape. Then we obtain a formula for a number which enumerates these partitions. We give two proofs for this formula, one by applying the above correspondence, the other by using the reflection principle. Finally, we give another expression for this number in terms of f(n, k)'s (see Section 5 for the definition o f f (n , k)).